Formally Veri ed On-Line Diagnosis
نویسندگان
چکیده
A reconngurable fault tolerant system achieves the attributes of dependability of operations through fault detection, fault isolation and reconnguration, typically referred to as the FDIR paradigm. Fault diagnosis is a key component of this approach, requiring an accurate determination of the health and state of the system. An imprecise state assessment can lead to catastrophic failure due to an optimistic diagnosis, or conversely, result in underutilization of resources because of a pessimistic diagnosis. Diiering from classical testing and other oo-line diagnostic approaches, we develop procedures for maximal utilization of the system state information to provide for continual, on-line diagnosis and reconnguration capabilities as an integral part of the system operations. Our diagnosis approach, unlike existing techniques, does not require administered testing to gather syndrome information but is based on monitoring the system message traac among redundant system functions. We present comprehensive on-line diagnosis algorithms capable of handling a continuum of faults of varying severity at the node and link level. Not only are the proposed algorithms on-line in nature, but are themselves tolerant to faults in the diagnostic process. Formal analysis is presented for all proposed algorithms. These proofs ooer both insight into the algorithm operations and facilitate a rigorous formal veriication of the developed algorithms.
منابع مشابه
Model Abstraction for Formal Veri cation
As the complexity of circuit designs grows, designers look toward formal veri cation to achieve better test coverage for validating complex designs. However, this approach is inherently computationally intensive, and hence, only small designs can be veri ed using this method. To achieve better performance, model abstraction is necessary. Model abstraction reduces the number of states necessary ...
متن کاملTracking Design Changes with Formal Machine - Checked Proof
Designs are often modi ed for use in new circumstances. If formal proof is to be an acceptable veri cation methodology for industry, it must be capable of tracking design changes quickly. We describe our experiences formally verifying an implementation of an ATM network component, and on our subsequent veri cation of modi ed designs. Three of the designs veri ed are in use in a working network....
متن کاملProviding a Formal Linkage between the MDG Veri cation System and HOL Proof System
We describe an approach for formally linking a symbolic state enumeration system and a theorem proving system based on a veri ed version of the former. It has been realized using the HOL system and a simpli ed version of the MDG system. It involves the following three steps. Firstly, we have veri ed aspects of correctness of a simpli ed version of the MDG system. We have made certain that the s...
متن کاملFormal Design and Veri cation of a Reliable Computing Platform For Real-Time Control Phase 2 Results
In this paper the design and formal veri cation of the Reliable Computing Platform (RCP), a fault-tolerant computing system for digital ight control applications, are presented. The RCP utilizes NMR-style redundancy to mask faults and internal majority voting to ush the e ects of transient faults. The system is formally speci ed and veri ed using the Ehdm veri cation system. A major goal of thi...
متن کاملConclusions from a Study to Verify a Real Network Component
We have formally veri ed several fabricated and working components of the Fairisle Asynchronous Transfer Mode communications network switch [2]. This was done using the HOL90 theorem proving system, an LCF style implementation of classical higher-order logic [3]. The designs were veri ed down to the logic gate level. All the proofs were fully machine-checked { no lemmas were assumed as axioms. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997